Stable Models of Fuzzy Propositional Formulas
نویسندگان
چکیده
We introduce the stable model semantics for fuzzy propositional formulas, which generalizes both fuzzy propositional logic and the stable model semantics of classical propositional formulas. Combining the advantages of both formalisms, the introduced language allows highly configurable default reasoning involving fuzzy truth values. We show that several properties of Boolean stable models are naturally extended to this formalism, and discuss how it is related to other approaches to combining fuzzy logic and the stable model semantics.
منابع مشابه
Fuzzy Propositional Formulas under the Stable Model Semantics
We define a stable model semantics for fuzzy propositional formulas, which generalizes both fuzzy propositional logic and the stable model semantics of classical propositional formulas. The syntax of the language is the same as the syntax of fuzzy propositional logic, but its semantics distinguishes stable models from non-stable models. The generality of the language allows for highly configura...
متن کاملOn equivalence of infinitary formulas under the stable model semantics
Propositional formulas that are equivalent in intuitionistic logic, or in its extension known as the logic of here-and-there, have the same stable models. We extend this theorem to propositional formulas with infinitely long conjunctions and disjunctions and show how to apply this generalization to proving properties of aggregates in answer set programming.
متن کاملPropositional Logic as a Propositional Fuzzy Logic
There are several ways to extend the classical logical connectives for fuzzy truth degrees, in such a way that their behavior for the values 0 and 1 work exactly as in the classical one. For each extension of logical connectives the formulas which are always true (the tautologies) changes. In this paper we will provide a fuzzy interpretation for the usual connectives (conjunction, disjunction, ...
متن کاملStable models for infinitary formulas with extensional atoms
The definition of stable models for propositional formulas with infinite conjunctions and disjunctions can be used to describe the semantics of answer set programming languages. In this note, we enhance that definition by introducing a distinction between intensional and extensional atoms. The symmetric splitting theorem for first-order formulas is then extended to infinitary formulas and used ...
متن کاملOn Equivalent Transformations of Infinitary Formulas under the Stable Model Semantics (Preliminary Report)
It has been known for a long time that intuitionistically equivalent formulas have the same stable models. We extend this theorem to propositional formulas with infinitely long conjunctions and disjunctions and show how to apply this generalization to proving properties of aggregates in answer set programming.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014